Evolutionary Computation Approaches to Cell Optimisation
نویسنده
چکیده
This paper examines a cellular manufacturing optimisation problem in a new facility of a pharmaceutical company. The new facility, together with the old one, should be adequate to handle current and future production requirements. The aim of this paper is to investigate the potential use of evolutionary computation in order to find the optimum configuration of the cells in the facility. The objective is to maximise the total number of batches processed per year in the facility. In addition, a two-objective optimisation search was implemented, using several evolutionary computation methods. One additional objective is to minimise the overall cost, which is proportional to the number of cells in the facility. The multiobjective optimisation programs were based on three approaches: The weighted-sum approach, the Pareto-optimality approach, and the Multiobjective Genetic Algorithm (MOGA) approach.
منابع مشابه
An Investigation into the Use of Swarm Intelligence for an Evolutionary Algorithm Optimisation - The Optimisation Performance of Differential Evolution Algorithm Coupled with Stochastic Diffusion Search
The integration of Swarm Intelligence (SI) algorithms and Evolutionary algorithms (EAs) might be one of the future approaches in the Evolutionary Computation (EC). This work narrates the early research on using Stochastic Diffusion Search (SDS) – a swarm intelligence algorithm – to empower the Differential Evolution (DE) – an evolutionary algorithm – over a set of optimisation problems. The res...
متن کاملComparison of Genetic Algorithms and Particle Swarm Optimisation for Fermentation Feed Profile Determination
In recent years the area of Evolutionary Computation has come into its own. Two of the popular developed approaches are Genetic Algorithms and Particle Swarm Optimisation, both of which are used in optimisation problems. Since the two approaches are supposed to find a solution to a given objective function but employ different strategies and computational effort, it is appropriate to compare th...
متن کاملSoftware ENgineering A Study into Ant Colony Optimisation, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems
We compare two heuristic approaches, evolutionary computation and ant colony optimisation, and a complete tree-search approach, constraint programming, for solving binary constraint satisfaction problems. We experimentally show that, if evolutionary computation is far from being able to compete with the two other approaches, ant colony optimisation nearly always succeeds in finding a solution, ...
متن کاملA Study into Ant Colony Optimisation, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems
We compare two heuristic approaches, evolutionary computation and ant colony optimisation, and a complete tree-search approach, constraint programming, for solving binary constraint satisfaction problems. We experimentally show that, if evolutionary computation is far from being able to compete with the two other approaches, ant colony optimisation nearly always succeeds in finding a solution, ...
متن کاملA Feature-Based Comparison of Evolutionary Computing Techniques for Constrained Continuous Optimisation
Evolutionary algorithms have been frequently applied to constrained continuous optimisation problems. We carry out feature based comparisons of different types of evolutionary algorithms such as evolution strategies, differential evolution and particle swarm optimisation for constrained continuous optimisation. In our study, we examine how sets of constraints influence the difficulty of obtaini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998